Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
نویسندگان
چکیده
In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O( √ n log n logdn e) amortized time per operation, where m is the number of edges and n is the number of nodes in the graph. This improves upon the results in [12], in which algorithms were presented running in O( √ m log n) amortized time, and solves the open problem to find certificates to speed up biconnectivity, as stated in [2].
منابع مشابه
Poly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms II : 2 - edge and biconnectivity
Deterministic fully dynamic algorithms are presented for 2-edge con-nectivity and biconnectivity. For 2-edge connectivity the amortized cost per operation is O(log 4 n) improving over the previous best deterministic bound of O(p n) and the previous best randomized bound of O(log 5 n). For biconnectivity the amortized cost per operation is also O(log 4 n) improving over the previous best determi...
متن کاملFully Dynamic Biconnectivity and Transitive Closure
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time i s exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log2n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time. Our algorithm is a LasVegas style randomized algorith...
متن کاملImplicit Decomposition for Write-Efficient Connectivity Algorithms
The future of main memory appears to lie in the direction of new technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads in terms of latency, bandwidth, and energy. Motivated by this trend, we propose sequential and parallel algorithms to solve graph connectivity problems using significantly fewer writes than conventiona...
متن کاملDynamic DFS in Undirected Graphs: breaking the O(m) barrier
Given an undirected graph G = (V, E) on n vertices and m edges, we address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results for this problem. 1. Fault tolerant DFS tree: There exists a data structure of size˜O(m) 1 such that given any set F of failed vertices or edges, a DFS tree of the gra...
متن کاملParallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity
This report deals with a parallel algorithmic technique that has proved to be very useful in the design of eecient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called \open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an eecient parallel algorithm for nding this decomposition a...
متن کامل